Bulkloading of Bitmap Indices
نویسنده
چکیده
The conventional indexing technique designed for the traditional database systems does not use the read-only characteristics of the data warehouse environment. Recently, Bitmap Indexing has been proposed as a candidate indexing structure suitable for the read-only environments, like those of decision support systems. The current paper presents a short literature survey of the various clone of this indexing structure, before presenting the design which is being implemented in Paradise. We present algorithms that can be used for query evaluation using bitmaps. Wherever possible a comparative study of bitmaps and the traditional RID list representation has been provided, with space-time tradeoos involved.
منابع مشابه
An Efficient Compression Scheme For Bitmap Indices
When using an out-of-core indexing method to answer a query, it is generally assumed that the I/O cost dominates the overall query response time. Because of this, most research on indexing methods concentrate on reduceing the sizes of indices. For bitmap indices, compression has been used for this purpose. However, in most cases, operations on these compressed bitmaps, mostly bitwise logical op...
متن کاملBitmap Indices for Speeding Up High-Dimensional Data Analysis
Bitmap indices have gained wide acceptance in data warehouse applications and are an efficient access method for querying large amounts of read-only data. The main trend in bitmap index research focuses on typical business applications based on discrete attribute values. However, scientific data that is mostly characterised by non-discrete attributes cannot be queried efficiently by currently s...
متن کاملBitmap Indices for Data Warehouses
In this chapter we discuss various bitmap index technologies for efficient query processing in data warehousing applications. We review the existing literature and organize the technology into three categories, namely bitmap encoding, compression and binning. We introduce an efficient bitmap compression algorithm and examine the space and time complexity of the compressed bitmap index on large ...
متن کاملUsing Bitmap Indexing Technology for Combined Numerical and Text Queries
In this paper, we describe a strategy of using compressed bitmap indices to speed up queries on both numerical data and text documents. By using an efficient compression algorithm, these compressed bitmap indices are compact even for indices with millions of distinct terms. Moreover, bitmap indices can be used very efficiently to answer Boolean queries over text documents involving multiple que...
متن کاملA Data Mining Approach for selecting Bitmap Join Indices
Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap...
متن کامل